Macaulay’s Problem

نویسنده

  • Marek Hudík
چکیده

The model of economic man is either empirically testable and false, or it is non-testable and always true. The fact that neither position is entirely satisfactory is called Macaulay’s problem. This paper first reviews and criticizes various attitudes toward this problem and then argues that Macaulay’s problem is a pseudoproblem, because it assumes that the explicandum of the economic man model is individual behavior. Contrary to this assumption it is argued that the model attempts to explain changes of people’s behavior on an aggregate level in response to changes in constraints. The paper posits that all the studied attitudes pertaining to Macaulay’s problem can be reinterpreted and, to a great extent, reconciled in light of this view. It is also argued that this view helps to explain why the usual criticisms of the economic man model miss the point. A method for effective criticism is suggested.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Unimodality of Pure O-Sequences of Type Two in Four Variables

Since the 1970’s, great interest has been taken in the study of pure O-sequences, which, due to Macaulay’s theory of inverse systems, have a bijective correspondence to the Hilbert functions of Artinian level monomial algebras. Much progress has been made in classifying these according to their shape. Macaulay’s theorem immediately gives us that all Artinian algebras in two variables have unimo...

متن کامل

Termination Analysis of Polynomial Programs with Equality Conditions

In this paper, we investigate the termination problem of a family of polynomial programs, in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equations. Our main result is that the non-terminating inputs of such a polynomial program is algorithmically computable according to a strictly descending chain of algebrai...

متن کامل

Efficient Computation of Multiplicity and Directional Multiplicity of an Isolated Point

The dual space of a primary ideal associated to an isolated point is a topic of study which appears in several occasions in symbolic computation. In the present work we elaborate on the computation of a representation for these dual spaces. A basis for the dual space reveals the multiplicity structure of the point under study. Macaulay’s algorithm is a classic algorithm for computing such a bas...

متن کامل

Algebraic Interpretation of a Theorem of Clements and Lindström

We study Hilbert functions of quotients of the truncated polynomial ring k[x1, . . . , xn]/ ( x1 1 , x e2+1 2 , . . . , xn n ) , where e1 ≥ e2 ≥ · · · ≥ en ≥ 1 are integers. We use the work of Clements-Lindström to recover the well-known Macaulay’s Theorem.

متن کامل

HILBERT SCHEMES and MAXIMAL BETTI NUMBERS over VERONESE RINGS

We show that Macaulay’s Theorem, Gotzmann’s Persistence Theorem, and Green’s Theorem hold over a Veronese toric ring R. We also prove that the Hilbert scheme over R is connected; this is an analogue of Hartshorne’s theorem that the Hilbert scheme over a polynomial ring is connected. Furthermore, we prove that each lex ideal in R has the greatest Betti numbers among all graded ideals with the sa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012